首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   152篇
  免费   57篇
  国内免费   11篇
  2023年   3篇
  2022年   3篇
  2021年   4篇
  2020年   7篇
  2019年   5篇
  2018年   5篇
  2017年   13篇
  2016年   12篇
  2015年   9篇
  2014年   19篇
  2013年   14篇
  2012年   14篇
  2011年   13篇
  2010年   7篇
  2009年   12篇
  2008年   10篇
  2007年   15篇
  2006年   9篇
  2005年   7篇
  2004年   5篇
  2003年   7篇
  2002年   7篇
  2001年   4篇
  2000年   3篇
  1999年   1篇
  1998年   2篇
  1997年   1篇
  1995年   2篇
  1993年   1篇
  1991年   3篇
  1989年   2篇
  1988年   1篇
排序方式: 共有220条查询结果,搜索用时 15 毫秒
151.
分析了影响气体开关重复频率的各因素,从理论上推导了开关耗能的恢复时间以及气体的冷却时间对重复频率的影响。提出了提高重复频率的方法。  相似文献   
152.
This paper considers a two-agent scheduling problem with linear resource-dependent processing times, in which each agent has a set of jobs that compete with that of the other agent for the use of a common processing machine, and each agent aims to minimize the weighted number of its tardy jobs. To meet the due date requirements of the jobs of the two agents, additional amounts of a common resource, which may be in discrete or continuous quantities, can be allocated to the processing of the jobs to compress their processing durations. The actual processing time of a job is a linear function of the amount of the resource allocated to it. The objective is to determine the optimal job sequence and resource allocation strategy so as to minimize the weighted number of tardy jobs of one agent, while keeping the weighted number of tardy jobs of the other agent, and the total resource consumption cost within their respective predetermined limits. It is shown that the problem is -hard in the ordinary sense, and there does not exist a polynomial-time approximation algorithm with performance ratio unless ; however it admits a relaxed fully polynomial time approximation scheme. A proximal bundle algorithm based on Lagrangian relaxation is also presented to solve the problem approximately. To speed up convergence and produce sharp bounds, enhancement strategies including the design of a Tabu search algorithm and integration of a Lagrangian recovery heuristic into the algorithm are devised. Extensive numerical studies are conducted to assess the effectiveness and efficiency of the proposed algorithms.  相似文献   
153.
对软件可靠性分配的遗传模型进行了研究,结合相关知识缩小了基本遗传算法的搜索区域,比较灵活地处理了非线性约束条件,提高了搜索效率,避免了早熟收敛现象.此外,在基本遗传算法中增加了保优操作,从而能够在理论上保证实现分配的最优化.算例表明,该算法十分有效.  相似文献   
154.
Capacity providers such as airlines often sell the same capacity to different market segments at different prices to improve their expected revenues. The absence of a secondary market, due to the nontransferability of airline tickets, gives rise to an opportunity for airlines to broker capacity between consumers with different willingness to pay. One way to broker capacity is by the introduction of callable products. The idea is similar to callable bonds where the issuer has the right, but not the obligation, to buy back the bonds at a certain price by a certain date. The idea of callable products was introduced before under the assumption that the fare-class demands are all independent. The independent assumption becomes untenable when there is significant demand recovery (respectively, demand cannibalization) when lower fares are closed (respectively, opened). In this case, consumer choice behavior should be modeled explicitly to make meaningful decisions. In this paper, we consider a general consumer choice model and develop the optimal strategy for callable products. Our numerical study illustrates how callable products are win-win-win, for the capacity provider and for both high and low fare consumers. Our studies also identify conditions for callable products to result in significant improvements in expected revenues.  相似文献   
155.
针对组网跟踪系统传感器分配算法计算量过大的问题,提出了一种基于Riccati方程的动态传感器分配算法。该算法通过Riccati方程离线计算各传感器组合跟踪下的稳态滤波协方差,根据稳态滤波协方差与期望协方差的接近程度动态分配传感器资源。仿真结果显示,与传统协方差控制和贪婪算法相比,基于Riccati方程的动态传感器分配算法在大大减少计算量的同时能够保持较好的跟踪性能。该方法能够更好地应用于大规模传感器组网目标协同跟踪系统。  相似文献   
156.
在蜂窝网络中部署D2D(Device-to-Device)通信能够有效提升频谱利用率,降低基站负载,但D2D用户与蜂窝用户共享无线信道时会产生信号干扰。提出了一种联合资源分配算法,通过综合考虑信道分配对网络中已有的蜂窝用户和D2D用户的信号干扰,并在小区范围内寻找具有最小干扰值的信道资源分配给用户,以实现有效的干扰控制。仿真结果显示:联合资源分配能够提升D2D链路、蜂窝链路的信噪比及系统总吞吐量,使得蜂窝网络的整体性能优于独立资源分配。  相似文献   
157.
Spatial pricing means a retailer price discriminates its customers based on their geographic locations. In this article, we study how an online retailer should jointly allocate multiple products and facilitate spatial price discrimination to maximize profits. When deciding between a centralized product allocation ((i.e., different products are allocated to the same fulfillment center) and decentralized product allocation (ie, different products are allocated to different fulfillment centers), the retailer faces the tradeoff between shipment pooling (ie, shipping multiple products in one package), and demand localization (ie, stocking products to satisfy local demand) based on its understanding of customers' product valuations. In our basic model, we consider two widely used spatial pricing policies: free on board (FOB) pricing that charges each customer the exact amount of shipping cost, and uniform delivered (UD) pricing that provides free shipping. We propose a stylized model and find that centralized product allocation is preferred when demand localization effect is relatively low or shipment pooling benefit is relatively high under both spatial pricing policies. Moreover, centralized product allocation is more preferred under the FOB pricing which encourages the purchase of virtual bundles of multiple products. Furthermore, we respectively extend the UD and FOB pricing policies to flat rate shipping (ie, the firm charges a constant shipping fee for each purchase), and linear rate shipping (ie, the firm sets the shipping fee as a fixed proportion of firm's actual fulfillment costs). While similar observations from the basic model still hold, we find the firm can improve its profit by sharing the fulfillment cost with its customers via the flat rate or linear rate shipping fee structure.  相似文献   
158.
针对多平台多目标协同跟踪中要求多个无人地面平台尽可能均匀地协同跟踪多个目标的特点,提出了改进的离散粒子群优化算法。首先采用连续型粒子群优化算法中的速度和位置迭代公式,然后对粒子位置进行离散编码,使粒子编码对应于可行的指派方案;其次,在优化算法中引入局部搜索,提高算法寻优性能。最后将所提算法应用于多平台多目标协同跟踪中的指派问题,并与未加入局部搜索的粒子群优化算法比较,仿真结果表明,加入局部搜索后的离散粒子群优化算法具有较好的寻优性能。  相似文献   
159.
并联系统可靠性分配的模糊层次分析法   总被引:1,自引:0,他引:1  
综合考虑影响系统可靠性分配的定性因素和定量因素、影响因素的模糊性以及系统的结构组成.利用层次分析法可集定性与定量分析于一体,从而确定出各影响因素对可靠性分配的权重向量;模糊数学理论进而确定出分系统之间可靠性水平的相对比重;进行模糊变换最终进行并联系统的可靠性分配.结合实例分析,对并联系统运用模糊理论和层次分析法相结合的方法进行可靠性分配科学、合理,便于工程应用.  相似文献   
160.
矩阵开关技术在通用ATS电源模块自检中的应用   总被引:2,自引:0,他引:2  
针对通用ATS中电源模块检查过程中存在检查时间长、劳动量大、工作效率低且易出错等问题,将矩阵开关技术引入通用ATS中电源模块的自检过程中,选取电压信号的均值和均方差作为评价电源模块性能的特征参数,并利用矩阵开关的多路复用功能设计了电源模块自检的拓扑结构,实现了自检过程中多通道的自动配置。仿真验证试验说明了该方法具有多通道自动配置、自检时间短、故障定位准确等优点。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号